a special class of stochastic pert networks

Authors

سید محمدتقی فاطمی قمی و مسعود ربانی

s. m. t. fatemi ghomi

m. rabbani

abstract

considering the network structure is one of the new approaches in studying stochastic pert networks (spn). in this paper, planar networks are studied as a special class of networks. two structural reducible mechanisms titled arc contraction and deletion are developed to convert any planar network to a series-parallel network structure. in series-parallel spn, the completion time distribution function can be calculated only by means of multiplication and convolution operations. for the first time, series-parallel networks are studied on the basis of the structural viewpoint. these networks belong to planar networks class. a key theorem provides capability of application of these mechanisms for non series-parallel planar networks

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

A special Class of Stochastic PERT Networks

Considering the network structure is one of the new approaches in studying stochastic PERT networks (SPN). In this paper, planar networks are studied as a special class of networks. Two structural reducible mechanisms titled arc contraction and deletion are developed to convert any planar network to a series-parallel network structure.&#10In series-parallel SPN, the completion time distribution...

full text

A special Class of Stochastic PERT Networks

Considering the network structure is one of the new approaches in studying stochastic PERT networks (SPN). In this paper, planar networks are studied as a special class of networks. Two structural reducible mechanisms titled arc contraction and deletion are developed to convert any planar network to a series-parallel network structure. In series-parallel SPN, the completion time distribution f...

full text

A New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks

In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...

full text

A New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks

In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...

full text

A New Approach to Approximate Completion Time Distribution Function of Stochastic Pert Networks

The classical PERT approach uses the path with the largest expected duration as the critical path to estimate the probability of completing a network by a given deadline. However, in general, such a path is not the most critical path (MCP) and does not have the smallest estimate for the probability of completion time. The main idea of this paper is derived from the domination structure between ...

full text

Solving Stochastic Pert Networks Exactly Using Hybrid Bayesian Networks

In this paper, we describe how a stochastic PERT network can be formulated as a Bayesian network. We approximate such PERT Bayesian network by mixtures of Gaussians hybrid Bayesian networks. Since there exists algorithms for solving mixtures of Gaussians hybrid Bayesian networks exactly, we can use these algorithms to make inferences in PERT Bayesian networks.

full text

My Resources

Save resource for easier access later


Journal title:
روش های عددی در مهندسی (استقلال)

جلد ۱۸، شماره ۱، صفحات ۴۳-۵۹

Keywords

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023